Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence

نویسندگان

  • Hui Wan
  • Michael Kifer
چکیده

Belief Logic Programming (BLP) is a novel form of quantitative logic programming in the presence of uncertain and inconsistent information, which was designed to be able to combine and correlate evidence obtained from non-independent information sources. BLP has non-monotonic semantics based on the concepts of belief combination functions and is inspired by Dempster-Shafer theory of evidence. Most importantly, unlike the previous efforts to integrate uncertainty and logic programming, BLP can correlate structural information contained in rules and provides more accurate certainty estimates. The results are illustrated via simple, yet realistic examples of rule-based Web service

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic, Knowledge Representation, and Bayesian Decision Theory

In this paper I give a brief overview of recent work on uncertainty inAI, and relate it to logical representations. Bayesian decision theory and logic are both normative frameworks for reasoning that emphasize different aspects of intelligent reasoning. Belief networks (Bayesian networks) are representations of independence that form the basis for understanding much of the recent work on reason...

متن کامل

Belief Logic Programming with Cyclic Dependencies

Our previous work [26] introduced Belief Logic Programming (BLP), a novel form of quantitative logic programming with correlation of evidence. Unlike other quantitative approaches to logic programming, this new theory is able to provide accurate conclusions in the presence of uncertainty when the sources of information are not independent. However, the semantics defined in [26] is not sufficien...

متن کامل

An Analysis of ATMS-Based Techniques for Computing Dempster-Shafer Belief Functions

This paper analyzes the theoretical under­ pinnings of recent proposals for computing Dempster-Shafer Belief functions from ATMS labels. Such proposals are intended to be a means of integrating symbolic and numeric rep­ resentation methods and of focusing search in the ATMS. This synthesis is formalized us­ ing graph theory, thus showing the relation­ ship between graph theory, the logic-theore...

متن کامل

Mathematical Programming Methods for Reasoning under Uncertainty

We survey three applications of mathematical programming to rea soning under uncertainty a an application of linear programming to probabilistic logic b an application of nonlinear programming to Bayesian logic a combination of Bayesian inference with probabilistic logic and c an application of integer programming to Dempster Shafer theory which is a method of combining evidence from di erent s...

متن کامل

A Complete Calcultis for Possibilistic Logic Programming with Fuzzy Propositional Variables

In this paper we present a propositional logic programming language for reasoning under possibilistic uncertainty and represent­ ing vague knowledge. Formulas are repre­ sented by pairs (ip, a), where ip is a many­ valued proposition and a E [0, 1] is a lower bound on the belief on ip in terms of necessity measures. Belief states are modeled by pos­ sibility distributions on the set of all many...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009